Prophet: automated scheduling of SPMD programs in workstation networks
نویسنده
چکیده
Jon B. Weissman Division of Computer Science University of Texas at San Antonio San Antonio, TX 78249 USA (210-458-5689 voice, 210-458-4437 fax) ([email protected]) Abstract Obtaining efficient execution of parallel programs in workstation networks is a difficult problem for the user. Unlike dedicated parallel computer resources, network resources are shared, heterogeneous, vary in availability, and offer communication performance that is still an order of magnitude slower than parallel computer interconnection networks. Prophet, a system that automatically schedules data parallel SPMD programs in workstation networks for the user has been developed. Prophet uses application and resource information to select the appropriate type and number of workstations, divide the application into component tasks and data across these workstations, and assign tasks to workstations. This system has been integrated into the Mentat parallel processing system developed at the University of Virginia. A suite of scientific Mentat applications have been scheduled using Prophet on a heterogeneous workstation network. The results are promising and demonstrate that scheduling SPMD applications can be automated with good performance1.
منابع مشابه
Run-time Support for Scheduling Parallel Applications in Heterogeneous NOWs
This paper describes the current state of Prophet — a system that provides run-time scheduling support for parallel applications in heterogeneous workstation networks. Prior work on Prophet [10][12] demonstrated that scheduling SPMD applications could be effectively automated with excellent performance. Enhancements have been made to Prophet to broaden its use to other application types includi...
متن کاملSupporting Self-Adaptivity for SPMD Message-Passing Applications
Real parallel applications nd little beneets from code porta-bility that does not guarantee acceptable eeciency. In this paper, we describe the new features of a framework that allows the development of Single Program Multiple Data (SPMD) applications adaptable to different distributed-memory machines, varying from traditional parallel computers to networks of workstations. Special programming ...
متن کاملCorrelation of the paging activity of individual node programs in the SPMD execution mode
In this paper we introduce a methodology for the analysis of the paging activity of parallel programs running on massively parallel systems. The methodology includes parallel program monitoring and the analysis of the collected data. We study the correlation of the paging activities of individual node programs in the SPMD execution mode and its effect on scheduling.
متن کاملIncorporation of Demand Response Programs and Wind Turbines in Optimal Scheduling of Smart Distribution Networks: A Case Study
Smart distribution networks (SDNs) plays a significant role in future power networks. Accordingly, the optimal scheduling of such networks, which include planning of consumers and production sections, inconsiderably concerned in recent research studies. In this paper, the optimal planning of energy and reserve of SDNs has been studied. Technical constraints of distribution network and power gen...
متن کاملAbstractions for Adaptive Data Parallelism
This paper describes how a class of data parallel programs (SPMD) may be expressed using reusable adaptive abstractions. The abstractions support adaptive use of a network of workstations for parallel computing. Although data parallelism is the paradigm considered the programs are expressed using message passing. The main contribution of this paper is to demonstrate how adaptive parallelism may...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Concurrency - Practice and Experience
دوره 11 شماره
صفحات -
تاریخ انتشار 1999